#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int t, n, x, y, w;
int main()
{
    cin >> t;
    while (t--)
    {
        cin >> n >> x >> y;
        vector<int> a(n);
        for (int i = 0; i < n; i++) cin >> a[i];
        sort(a.begin(), a.end());
        if (n == 0)
        {
            cout << min(1.0 * max(a[0] - y, 0), 1.0 * a[0] * x / 100) << '\n';
        }
        else
        {
            double ans = 0;
            for (int i = 0; i < n - 2; i++) ans += a[i];
            ans += min(1.0 * a[n - 1] * x / 100 + max(a[n - 2] - y, 0), 1.0 * a[n - 2] * x / 100 + max(a[n - 1] - y, 0));
            cout << ans << '\n';
        }
    }
    return 0;
}